Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem
نویسندگان
چکیده
In this paper we introduce a new algorithm for secondary school timetabling, inspired by the classical bipartite graph edge colouring algorithm for basic class-teacher timetabling. We give practical methods for generating large sets of meetings that can be timetabled to run simultaneously, and for building actual timetables based on these sets. We report promising empirical results for one real-world instance of the problem.
منابع مشابه
Tackling the edge dynamic graph colouring problem with and without future adjacency information
Many real world operational research problems, such as frequency assignment and exam timetabling, can be reformulated as graph colouring problems (GCPs). Most algorithms for theGCPoperate under the assumption that its constraints are fixed, allowing us to model the problem using a static graph. However, in many real-world cases this does not hold and it is more appropriate to model problems wit...
متن کاملBalanced list edge-colourings of bipartite graphs
Galvin solved the Dinitz conjecture by proving that bipartite graphs are ∆edge-choosable. We improve Galvin’s method and deduce from any colouring of the edges of bipartite graph G some further list edge-colouring properties of G. In particular, for bipartite graphs, it follows from the existence of balanced bipartite edge-colourings that balanced list edge-colourings exist as well. While the k...
متن کاملOn a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling
Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a new formulation of vertex colouring using a suitable clique partition of the graph. This formulation is applicable in timetabling applica...
متن کاملLinear combinations of heuristics for examination timetabling
Although they are simple techniques from the early days of timetabling research, graph colouring heuristics are still attracting significant research interest in the timetabling research community. These heuristics involve simple ordering strategies to first select and colour those vertices that are most likely to cause trouble if deferred until later. Most of this work used a single heuristic ...
متن کاملبرنامهریزی درسی در دانشگاه به کمک مدل‌سازی دو مرحله‌ای برنامه‌ریزی ریاضی
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002